A Method for Evaluating Elicitation Schemes for Probabilities
نویسندگان
چکیده
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if we assume that the expert’s knowledge is manifested essentially as a database of records that have been collected in the course of the expert’s experience, and if this database of records were available to us, then the structure and parameters of the expert’s beliefs could be reliably constructed using techniques for Bayesian learning from data. This learned model could, in turn, be compared to elicited models to judge the effectiveness of the elicitation process. We describe a general procedure by which it is possible to capture the data corresponding to the expert’s beliefs, and we present a simple experiment in which we utilize this technique to compare three methods for eliciting discrete probabilities: (1) direct numerical assessment, (2) the probability wheel, and (3) the scaled probability bar. We show that for our domain, the scaled probability bar is the most effective tool for probability
منابع مشابه
A method for evaluating elicitation schemes for probabilistic models
We present an objective approach for evaluating probability and structure elicitation methods in probabilistic models. The main idea is to use the model derived from the experts' experience rather than the true model as the standard to compare the elicited model. We describe a general procedure by which it is possible to capture the data corresponding to the expert's beliefs, and we present a s...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کاملEffectiveness of Preference Elicitation in Combinatorial Auctions
Combinatorial auctions where agents can bid on bundles of items are desirable because they allow the agents to express complementarity and substitutability between the items. However, expressing one’s preferences can require bidding on all bundles. Selective incremental preference elicitation by the auctioneer was recently proposed to address this problem [4], but the idea was not evaluated. In...
متن کاملElicitation of Subjective Probabilities in the Light of Signal Detection Theory
Most theories of decision-making under uncertainty are based on the idea that individuals weight events by some (transformation of) subjective probabilities. Elicitation of these subjective probabilities has thus became a major concern for evaluating and applying these models. In order to do so, one needs: (i) to be sure that such subjective probabilities actually exist in individuals’ minds an...
متن کاملEfficient robust elicitation of individual utility and decision weight functions
Abstract: In choice under risk an individual decision making is typically described by an individual's utility function over monetary outcomes and an individual’s decision weight function over probabilities. A three-stage procedure is proposed for efficient robust nonparametric elicitation of these functions. First, a tradeoff method is used to elicit several probabilities with a known individu...
متن کامل